Engineering Tree Kernels for Semantic Role Labelling Systems
نویسندگان
چکیده
Semantic Role Labelling (SRL) is a complex Natural Language Processing (NLP) task that has received a lot of attention in the latest years. An accurate shallow semantic parser, that recognized predicate-argument structures in a sentence and assigned each argument a semantic (or thematic) role, could be a key factor of larger NLP architectures, human-machine interaction (e. g. high level, semantic-oriented browsing and search systems), information extraction and dialogue based systems, just to name a few. The recognition of semantic structures within a sentence relies on lexical and syntactic information provided by earlier stages of an NLP process, such as lexical analysis, POS (part of speech) tagging and syntactic parsing. The complexity of the SRL task mostly lies in that: (a) this information is generally noisy, i. e. in a real-world scenario the accuracy and reliability of NLP subsystems are generally not very high; (b) the lack of a sound and complete linguistic or cognitive theory about the links between syntax and semantics doesn’t allow an informed, deductive approach to the problem. Still, the large amount of lexical and syntactic information available allows for an inductive approach to the SRL task, which indeed is generally
منابع مشابه
Tree Kernel Engineering in Semantic Role Labeling Systems
Recent work on the design of automatic systems for semantic role labeling has shown that feature engineering is a complex task from a modeling and implementation point of view. Tree kernels alleviate such complexity as kernel functions generate features automatically and require less software development for data extraction. In this paper, we study several tree kernel approaches for both bounda...
متن کاملTree Kernel Engineering for Proposition Re-ranking
Recent work on the design of automatic systems for semantic role labeling has shown that such task is complex from both modeling and implementation point of views. Tree kernels alleviate such complexity as kernel functions generate features automatically and require less software development for data pre-processing. In this paper, we study several tree kernel approaches for boundary detection, ...
متن کاملTree Kernels for Semantic Role Labeling
The availability of large scale data sets of manually annotated predicate–argument structures has recently favored the use of machine learning approaches to the design of automated semantic role labeling (SRL) systems. The main research in this area relates to the design choices for feature representation and for effective decompositions of the task in different learning models. Regarding the f...
متن کاملEfficient Linearization of Tree Kernel Functions
The combination of Support Vector Machines with very high dimensional kernels, such as string or tree kernels, suffers from two major drawbacks: first, the implicit representation of feature spaces does not allow us to understand which features actually triggered the generalization; second, the resulting computational burden may in some cases render unfeasible to use large data sets for trainin...
متن کاملSemantic Role Labelling with Tree Conditional Random Fields
In this paper we apply conditional random fields (CRFs) to the semantic role labelling task. We define a random field over the structure of each sentence’s syntactic parse tree. For each node of the tree, the model must predict a semantic role label, which is interpreted as the labelling for the corresponding syntactic constituent. We show how modelling the task as a tree labelling problem allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006